1972C - Permutation Counting - CodeForces Solution

def d():
    n, k = list(map(int, input().split()))
    a = list(map(int, input().split()))
    a.sort()
    curr = a[0]
    for i in range(1, n):
        c = min(a[i]-curr, k//i)
        curr += c
        k -= c*i
        if k == 0:
            break
    return (curr*n+(k+sum(x > curr for x in a)))-(n-1)
     
for i in range(int(input())):
    print(d())